Some results about proximal-like methods
نویسنده
چکیده
We view some ideas for improvement, extension and application of proximal point methods and the auxiliary problem principle to variational inequalities in Hilbert spaces. These methods are closely related and will be joined in a general framework, which admits a consecutive approximation of the problem data including applications of finite element techniques and the ε-enlargement of monotone operators. With the use of a ”reserve of monotonicity” of the operator in the variational inequality, the concepts of weakand elliptic proximal regularization are developed. Considering Bregman-function-based proximal methods, we analyze their convergence under a relaxed error tolerance criterion in the subproblems. Moreover, the case of variational inequalities with non-paramonotone operators is investigated, and an extension of the auxiliary problem principle with the use of Bregman functions is studied. To emphasize the basic ideas, we renounce all the proofs and sometimes precise descriptions of the convergence results and approximation techniques. Those can be found in the referred papers.
منابع مشابه
Proximal Algorithms
This monograph is about a class of optimization algorithms called proximal algorithms. Much like Newton’s method is a standard tool for solving unconstrained smooth optimization problems of modest size, proximal algorithms can be viewed as an analogous tool for nonsmooth, constrained, large-scale, or distributed versions of these problems. They are very generally applicable, but are especially ...
متن کاملA Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
We propose a class of interior proximal-like algorithms for the second-order cone program which is to minimize a closed proper convex function subject to general second-order cone constraints. The class of methods uses a distance measure generated by a twice continuously differentiable strictly convex function on (0,+∞), and includes as a special case the entropy-like proximal algorithm [12] wh...
متن کاملReply to “A Critical Review of Proximal Fibular Osteotomy for Knee Osteoarthritis”
Proximal fibular osteotomy is a surgical procedure that has evoked significant interest and controversy in the recent past. Vaishya et al have made a significant effort in compiling the available evidence on the topic. However, we would like to make some significant suggestions and additions to the findings in their manuscript.
متن کاملExistence of common best proximity points of generalized $S$-proximal contractions
In this article, we introduce a new notion of proximal contraction, named as generalized S-proximal contraction and derive a common best proximity point theorem for proximally commuting non-self mappings, thereby yielding the common optimal approximate solution of some fixed point equations when there is no common solution. We furnish illustrative examples to highlight our results. We extend so...
متن کاملProximal-Like Incremental Aggregated Gradient Method with Linear Convergence under Bregman Distance Growth Conditions
We introduce a unified algorithmic framework, called proximal-like incremental aggregated gradient (PLIAG) method, for minimizing the sum of smooth convex component functions and a proper closed convex regularization function that is possibly non-smooth and extendedvalued, with an additional abstract feasible set whose geometry can be captured by using the domain of a Legendre function. The PLI...
متن کامل